Functional Limit Theorems for Multiparameter Fractional Brownian Motion

We prove a general functional limit theorem for multiparameter fractional Brownian motion. The functional law of the iterated logarithm, functional Lévy’s modulus of continuity and many other results are its particular cases. Applications to approximation theory are discussed.      

Little higgs models and T parity

Little Higgs models are an interesting extension of the Standard Model at the TeV scale. They provide a simple and attractive mechanism of electroweak symmetry breaking. We review one of the simplest models of this class, the Littlest Higgs model, and its extension with T parity. The model with T parity satisfies precision electroweak constraints without fine-tuning, contains an attractive dark matter candidate, and leads to interesting phenomenology at the Large Hadron Collider (LHC).     

The Level-split of the Two-level Entangled Atom in an Optical Field

The behavior of a two-level entangled atom in an optical field with circular polarization is studied in this paper. The interaction of an optical field and one of the entangled atoms is analyzed in detail. A general solution of the SchrAo¨Gdinger equation about the motion of the entangled atom is obtained. The properties of the action are dependent on the initial state of the atom. By detecting the entangled atom out of the field, we can obtain the state of the other atom moving in the field. It is shown that the state of the atom out of the field will influence the energies of the split-levels of the atom in the field.     

Lorentz-Compton佯谬与一个双赢判决性散射实验设计

通过对“可见光区域是否存在Compton效应”的讨论而进一步深化到经典条件下“光的量子理论能否包含光的经典电磁理论”的实验验证,发现了Lorentz-Compton佯谬,并基于逆Compton散射设计了一个敏感而又可行的双赢判决性散射实验来解决此佯谬。     

基于特征圆单目视觉的飞机舵面角位移标定技术

提出了一种基于特征圆单目视觉的非接触式飞机舵面角位移标定技术。用一台数码摄像机对固定在飞机舵面上的特征圆进行拍照,经数字图像处理后确定五个特征点的坐标,利用针孔成像和射影变换原理建立物像空间坐标解算模型,计算出特征圆的法线相对方向和圆心的相对位置,舵面角位移由该圆的法线方向确定。仿真结果表明,该方法具有标定过程简单、实时、快速和准确的特点,标定精度可达到0.1°。该技术也可用于航天器上实时测量交会对接时的相对位姿参数。     

上海基础房价相关指标及走势的分析与研究

基础房价的相关指标及其走势一直是大众关心的热门话题．本文通过对上海基础房价相关指标的分析，建立了市场房价走势的两个数学模型．模型一：在相关性分析的基础上利用主成分分析消除指标间的共线性，再用回归拟合房价模型并进行预测；模型二：在相关性分析的基础上利用核估计方法预测出房价．继呵对2005年下半年的房价走势进行了预测，得出的结果与实际情况相吻合．     

Fast algorithms for determining the linear complexities of sequences over GF(pm) with the period 3n

In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p ^m) (any positive integer m) with the period 3n (n and p ^m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura algorithm, we can determine the linear complexity of any sequence over GF(p ^m) with the period 3n (n and p ^m − 1 are coprime) more efficiently.     

高空偏北大风与有无暴雨的对比分析

利用常规观测资料对1991～1996年江淮地区梅雨期的高、低层流场进行合成诊断分析，比较了高空偏北大风下有无暴雨在天气形势、物理量特征、三维流场方面的差异，文中一些分析结果可供暴雨预报参考。     

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.